Benders Decomposition for Mixed- Integer Hydrothermal Problems by Lagrangean Relaxation
نویسندگان
چکیده
Decomposition models with integer variables usually decompose into a master problem that comprises all the integer variables and subproblems, which evaluate the remaining variables. Subproblems with integer variables introduce additional difficulties and require the use of nonlinear duality theory. In this paper we address the solution of a mixed integer hydrothermal coordination problem combining nested Benders decomposition and lagrangean relaxation. An extensive computational study applied to a large-scale hydrothermal problem is presented.
منابع مشابه
Stochastic power generation unit commitment in electricity markets: a novel formulation and comparison of solution methods
We propose a stochastic unit commitment model for a power generation company that takes part in an electricity spot market. The relevant feature of this model is its detailed representation of the spot market during a whole week, including seven day-ahead market sessions and the corresponding adjustment market sessions. The adjustment market sessions can be seen as an hour-ahead market mechanis...
متن کاملA cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
We describe a decomposition algorithm that combines Benders and scenariobased Lagrangean decomposition for two-stage stochastic programming investment planning problems with complete recourse, where the first-stage variables are mixedinteger and the second-stage variables are continuous. The algorithm is based on the cross-decomposition scheme and fully integrates primal and dual information in...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملReformulation and Decomposition of Integer Programs
We examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover reformulations based on decomposition, such as Lagrangean relaxation, the Dantzig-Wolfe reformulation and the resulting column generation ...
متن کاملConvergence properties of generalized Benders decompositions
This paper addresses two major issues related to the convergence of generalized Benders decomposition which is an algorithm for the solution of mixed integer linear and nonlinear programming problems. First, it is proved that a mixed integer nonlinear programming formulation with zero nonlinear programming relaxation gap requires only one Benders cut in order to converge, namely the cut corresp...
متن کامل